Distributed Environment Modeling using Path Compression Algorithm

Modeling Distributed Algorithm Using B

Although there have been several attempts to create grid systems, there is no clear definition for grids. In this paper, a formal approach is presented for defining elementary functionalities of distributed systems. We shall illustrate the use of a certain formal technical for developing distributed algorithms.This technique uses a so-called “event driven” approach together with the B-Method .T...

Distributed Path Consensus Algorithm

Path planning methods based on discrete graph searches are highly effective in dealing with large-scale environments, arbitrarily shaped obstacles, frequent map updates and complex cost functions. When it comes to planning for teams of coupled agents however, typical graph searchbased planning techniques quickly become infeasible due to the exponential growth of the dimensionality of the joint ...

An 'All Pairs Shortest Path' Distributed Algorithm Using 2n² Messages

Efficient Distributed Algorithm for RWA Using Path Protection

A number of Integer Linear Program (ILP) formulations for both static and dynamic lightpath allocation have been proposed, for the design of survivable WDM networks. However, such formulations become computationally intractable for larger networks. In this paper, we present two heuristic algorithms for dynamic lightpath allocation, using both dedicated and shared path protection. The first is a...

An Adaptive Distributed Dijkstra Shortest Path Algorithm

We give a distributed algorithm to compute shortest paths in a network with changing topology. It does not suffer from the routing table looping behavior associated with the Ford-Bellman tdistributed shortest path algorithm although it uses truly distributed processing. Its time and message complexities are evaluated. Pierre Humblet is with the Laboratory for Information and Decision Systems, M...